A Modified Version of the Vigenère Algorithm
نویسندگان
چکیده
Stream ciphers in general tend to be weak since they lack the benefit of diffusion. It is for this reason alone that the Vigenère cipher is able to be cracked. Without the ability to detect cycles, and intern, derive the key length, the Vigenère cipher would be highly secure. By adding a few bits of random padding to each byte, one can diffuse the statistical retentiveness found within most messages. The exact quantity of pad will be determined by a one way function in an effort to eliminate the distinguishably of the message bits from the padded random bits. This methodology moderately increases the size of the cipher text, but greatly increases the security of the cipher
منابع مشابه
Optimal Placement of Capacitor Banks Using a New Modified Version of Teaching-Learning- Based Optimization Algorithm
Meta-heuristics optimization methods are important techniques for optimal design of the engineering systems. Numerous methods, inspired by different nature phenomena, have been introduced in the literature. A new modified version of Teaching-Learning-Based Optimization (TLBO) Algorithm is introduced in this paper. TLBO, as a parameter free algorithm, is based on the learning procedure of studen...
متن کاملSHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
The main aim of the present study is to propose a modified harmony search (MHS) algorithm for size and shape optimization of structures. The standard harmony search (HS) algorithm is conceptualized using the musical process of searching for a perfect state of the harmony. It uses a stochastic random search instead of a gradient search. The proposed MHS algorithm is designed based on elitism. In...
متن کاملA Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006